| 翻訳と辞書 |
| Low-complexity art ： ウィキペディア英語版 |
Low-complexity art
Low-complexity art, first described by Jürgen Schmidhuber in 1997〔J. Schmidhuber. Low-complexity art. Leonardo, Journal of the International Society for the Arts, Sciences, and Technology, 30(2):97–103, 1997. http://www.jstor.org/pss/1576418〕 and now established as a seminal topic within the larger field of computer science,〔McCormack, John and Mark d'Inverno, "Computers and Creativity", Springer, 2012, p. 323.〕〔Kharkhurin, Anatoliy V., "Multilingualism and Creativity", Multilingual Matters, 2012, p. 122.〕〔Li, Ming and Paul M.B. Vitányi, "An Introduction to Kolmogorov Complexity and Its Applications", Springer, 2008, p. 755.〕〔DiChio, Cecilia, "Applications of Evolutionary Computation", Springer, 2010, p. 302.〕〔Parisi, Luciana, "Contagious Architecture: Computation, Aesthetics, and Space", MIT Press, 2013, p. 290.〕 is art that can be described by a short computer program (that is, a computer program of small Kolmogorov complexity).
==Overview==
Schmidhuber characterizes low-complexity art as the computer age equivalent of minimal art. He also describes an algorithmic theory of beauty and aesthetics based on the principles of algorithmic information theory and minimum description length. It explicitly addresses the subjectivity of the observer and postulates that among several input data classified as comparable by a given subjective observer, the most pleasing one has the shortest description, given the observer’s previous knowledge and his or her particular method for encoding the data. For example, mathematicians enjoy simple proofs with a short description in their formal language (sometimes called mathematical beauty). Another example draws inspiration from 15th century proportion studies by Leonardo da Vinci and Albrecht Dürer: the proportions of a beautiful human face can be described by very few bits of information.〔J. Schmidhuber. Facial beauty and fractal geometry. Cogprint Archive: http://cogprints.soton.ac.uk , 1998〕〔J. Schmidhuber. Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity. Proc. 10th Intl. Conf. on Discovery Science (DS 2007) p. 26-38, LNAI 4755, Springer, 2007. Also in Proc. 18th Intl. Conf. on Algorithmic Learning Theory (ALT 2007) p. 32, LNAI 4754, Springer, 2007. Joint invited lecture for DS 2007 and ALT 2007, Sendai, Japan, 2007. http://arxiv.org/abs/0709.0674〕
Schmidhuber explicitly distinguishes between beauty and interestingness. He assumes that any observer continually tries to improve the predictability and compressibility of the observations by discovering regularities such as repetitions and symmetries and fractal self-similarity. When the observer's learning process (which may be a predictive neural network) leads to improved data compression the number of bits required to describe the data decreases. The temporary interestingness of the data corresponds to the number of saved bits, and thus (in the continuum limit) to the first derivative of subjectively perceived beauty. A reinforcement learning algorithm can be used to maximize the future expected data compression progress. It will motivate the learning observer to execute action sequences that cause additional interesting input data with yet unknown but learnable predictability or regularity. The principles can be implemented on artificial agents which then exhibit a form of artificial curiosity.〔J. Schmidhuber. Curious model-building control systems. International Joint Conference on Neural Networks, Singapore, vol 2, 1458–1463. IEEE press, 1991〕
While low-complexity art does not require a priori restrictions of the description size, the basic ideas are related to the size-restricted intro categories of the demoscene, where very short computer programs are used to generate pleasing graphical and musical output.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Low-complexity art」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|